Pure Strategies in Imperfect Information Stochastic Games
نویسندگان
چکیده
منابع مشابه
Pure Strategies in Imperfect Information Stochastic Games
We consider imperfect information stochastic games where we require the players to use pure (i.e. non randomised) strategies. We consider reachability, safety, Büchi and coBüchi objectives, and investigate the existence of almost-sure/positively winning strategies for the first player when the second player is perfectly informed or more informed than the first player. We obtain decidability res...
متن کاملPure and Stationary Optimal Strategies in Perfect-Information Stochastic Games
We consider two-players zero-sum perfect information stochastic games with finitely many states and actions and examine the problem of existence of pure stationary optimal strategies. We show that the existence of such strategies for one-player games (Markov decision processes) implies the existence of such strategies for two-player games. The result is general and holds for any payoff mapping.
متن کاملQualitative Concurrent Stochastic Games with Imperfect Information
We study a model of games that combines concurrency, imperfect information and stochastic aspects. Those are finite states games in which, at each round, the two players choose, simultaneously and independently, an action. Then a successor state is chosen accordingly to some fixed probability distribution depending on the previous state and on the pair of actions chosen by the players. Imperfec...
متن کاملFinding Optimal Strategies for Imperfect Information Games
Ian Frank Complex Games Lab Electrotechnical Laboratory Umezono 1-1-4, Tsukuba Ibaraki, JAPAN 305 [email protected] David Basin Institut f ur Informatik Universitat Freiburg Am Flughafen 17 Freiburg, Germany [email protected] Hitoshi Matsubara Complex Games Lab Electrotechnical Laboratory Umezono 1-1-4, Tsukuba Ibaraki, JAPAN 305 [email protected] Abstract We examine three heuris...
متن کاملComputing Equilibria in Multiplayer Stochastic Games of Imperfect Information
Computing a Nash equilibrium in multiplayer stochastic games is a notoriously difficult problem. Prior algorithms have been proven to converge in extremely limited settings and have only been tested on small problems. In contrast, we recently presented an algorithm for computing approximate jam/fold equilibrium strategies in a three-player nolimit Texas hold’em tournament—a very large realworld...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Informaticae
سال: 2018
ISSN: 0169-2968,1875-8681
DOI: 10.3233/fi-2018-1687